CR Variants of Hybrid Bi-CG Methods for Solving Linear Systems with Nonsymmetric Matrices

نویسنده

  • Kuniyoshi Abe
چکیده

s at ICCAM 2008 CR Variants of Hybrid Bi-CG Methods for Solving Linear Systems with Nonsymmetric Matrices Kuniyoshi Abe Gifu Shotoku University 1-38, Nakauzura, Gifu, 500-8288 Japan [email protected] Joint work with: S. Fujino By Krylov subspace methods, we are solving a large sparse linear system Ax = b, where A stand for an n-by-n matrix, and x and b are n-vectors, respectively. The Bi-Conjugate Gradient (Bi-CG) method is a well-known generic Krylov subspace method for this problem, and a number of hybrid Bi-CG methods such as the Conjugate Gradient Squared method (CGS), the Bi-Conjugate Gradient STABilized method (Bi-CGSTAB), the BiCGStab2 method, the Generalized Product-type method based on Bi-CG (GPBi-CG) and the BiCGstab(l) method have been developed as faster and smoother modifications of Bi-CG. Moreover, the Conjugate Residual (CR) method has been known as a Krylov subspace method based on the minimum residual approach. Also the Bi-Conjugate Residual (Bi-CR) method has been proposed as CR for nonsymmetric matrices. It is reported that the residual norm of CR decreases more smoothly than that of Bi-CG, and that the residual norm of Bi-CR converges faster than that of Bi-CG. However, the hybrid Bi-CG methods based on CR for nonsymmetric matrices have not previously been proposed. Therefore, we propose CR variants of hybrid Bi-CG methods for solving linear systems with nonsymmetric matrices. In other words, the Bi-CG part of the residual polynomials of the hybrid Bi-CG methods is replaced by CR for nonsymmetric matrices. The recurrence formulas for updating an approximation and a residual vector are the same as those of the original hybrid Bi-CG methods, while the recurrence coefficients αk and βk are determined so as to compute the coefficients of the residual polynomial of CR for nonsymmetric matrices. Numerical experiments show that our proposed CR variants of hybrid Bi-CG methods are more effective than the original hybrid Bi-CG methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs

In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...

متن کامل

Further improvements in nonsymmetric hybrid

In the past few years new methods have been proposed that can be seen as combinations of standard Krylov subspave methods, such as Bi{ CG and GMRES. One of the rst hybrid schemes of this type is CGS, actually the Bi{CG squared method. Other such hybrid schemes include BiCGSTAB (a combination of Bi{CG and GMRES(1)), QMRS, TFQMR, Hybrid GMRES (polynomial preconditioned GMRES) and the nested GMRES...

متن کامل

A stabilized GPBiCG method with a strategy to remedy accuracy of Bi-CG coefficients for solving linear systems

Bi-conjugate gradient (Bi-CG) is a well-known method for solving linear systems Ax = b for x, where A is a given n-by-n matrix, and b a given n-vector. A number of hybrid Bi-CG methods such as conjugate gradient squared (CGS), Bi-CG STABilized (Bi-CGSTAB), BiCGStab2, BiCGstab(`), Generalized Product-type Bi-CG (GPBiCG), and BiCG×MR2 have been developed to improve the convergence of Bi-CG and to...

متن کامل

DELFT UNIVERSITY OF TECHNOLOGY REPORT 07-07 IDR(s): a family of simple and fast algorithms for solving large nonsymmetric linear systems

We present IDR(s), a new family of efficient, short-recurrence methods for large nonsymmetric systems of linear equations. The new methods are based on the Induced Dimension Reduction (IDR) method proposed by Sonneveld in 1980. While state-ofthe-art methods such as Bi-CGSTAB require at most 2N matrix-vector products to compute an exact solution in exact arithmetic, IDR(s) requires at most N + N...

متن کامل

Flexible GPBi-CG Method for Nonsymmetric Linear Systems

We present a flexible version of GPBi-CG algorithm which allows for the use of a different preconditioner at each step of the algorithm. In particular, a result of the flexibility of the variable preconditioner is to use any iterative method. For example, the standard GPBi-CG algorithm itself can be used as a preconditioner, as can other Krylov subspace methods or splitting methods. Numerical e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008